Regression Analysis of Multi-Rendezvous Recharging Route in Multi-Robot Environment

نویسندگان

  • Soheil Keshmiri
  • Shahram Payandeh
چکیده

One of the crucial issue in the field of autonomous mobile robotics is the vitality of energy efficiency of robots and the entire system they form. By efficiency here we refer to ability of robots (or the system in which they are deployed) to maintain their survival throughout the course of the operation so as to provide themselves with the opportunity of attaining energy once needed. In this paper, issue of recharging of a group of autonomous worker robots in their working environment has been addressed. To deliver the objective, a tanker robot’s planner, capable of determining an energy supply route based on regression analysis techniques, has been implemented. Specifically we have examined the practicality of ordinary and weighted least squares (OLS and WLS respectively) as well as orthogonal least absolute values (ORLAV) regressions for recharging route computation (hence the terms Least Square Recharging Route (LSRR) and Orthogonal Recharging Route (ORR)). Studies were conducted (while examining OLS and WLS techniques) to analyze the effect of various uncertainties which may exist in location information of the robots with regards to the recharging route. It has been proven that ORLAV based planner may result to a recharging route that minimizes the cumulative sum of worker robots distance traversal during the recharging process, irrespective of tanker location. Simulations in both, environment with and without obstacles, have been conducted to examine the practicality of the techniques in contrast with fixed charging station sceS. Keshmiri (B) · S. Payandeh Experimental Robotics Laboratory, School of Engineering Science, Simon Fraser University, 8888 University Drive, Burnaby, BC, Canada V5A 1S6 e-mail: [email protected] S. Payandeh e-mail: [email protected] nario. Appropriate graphs, diagrams and tables, representing the results obtained in simulations are provided for illustrative comparisons among different techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collaborative Robot Exploration and Rendezvous: Algorithms, Performance Bounds and Observations

We consider the problem of how two heterogeneous robots can arrange to meet in an unknown environment from unknown starting locations: that is, the problem of arranging a robot rendezvous. We are interested, in particular, in allowing two robots to rendezvous so that they can collaboratively explore an unknown environment. Specifically, we address the problem of how a pair of exploring agents t...

متن کامل

Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots

In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...

متن کامل

Effects of Moving Landmark’s Speed on Multi-Robot Simultaneous Localization and Mapping in Dynamic Environments

Even when simultaneous localization and mapping (SLAM) solutions have been broadly developed, the vast majority of them relate to a single robot performing measurements in static environments. Researches show that the performance of SLAM algorithms deteriorates under dynamic environments. In this paper, a multi-robot simultaneous localization and mapping (MR-SLAM) system is implemented within a...

متن کامل

Discrete Path Planning Strategies for Coverage and Multi-robot Rendezvous

This thesis addresses the problem of motion planning for autonomous robots, given a map and an estimate of the robot pose within it. The motion planning problem for a mobile robot can be defined as computing a trajectory in an environment from one pose to another while avoiding obstacles and optimizing some objective such as path length or travel time, subject to constraints like vehicle dynami...

متن کامل

Learning to Rendezvous during Multi-agent Explo- ration

We consider the problem of rendezvous between two robots collaborating in learning the layout of an unknown environment. That is, how can two autonomous exploring agents that cannot communicate with one another over long distances meet if they start exploring at di erent locations in an unknown environment. The intended application is collaborative map exploration. Ours is the rst work to forma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Social Robotics

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2012